#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T>
using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x)&(-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz size()

void solve() {
    int n, q;
    cin >> n >> q;

    V<int>a(n);
    for (auto& x : a)cin >> x;

    sort(ALL(a));

    function<bool(int, int, int)>check = [&](int x, int b, int k){
        int l = b - x, r = b + x;
        return upper_bound(ALL(a), r) - lower_bound(ALL(a), l) >= k;
        };

    while (q--){
        int b, k;
        cin >> b >> k;
        int l = -1, r = 1e12;
        while (l + 1 != r){
            int mid = l + r >> 1;
            if (check(mid, b, k))r = mid;
            else l = mid;
        }
        cout << r << endl;
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}